Bisimulations Model Descriptions and Propositional Quanti ers

نویسنده

  • Albert Visser
چکیده

In this paper we give perspicuous proofs of the existence of model descriptions for nite Kripke models and of Uniform Interpolation for the theories IPC K GL and S Grz using bounded bisim ulations

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Expressive Power of Modal Logics on Trees

Various logical languages are compared regarding their expressive power with respect to models consisting of nitely bounded branching in nite trees The basic multimodal logic with backward and forward necessity operators is equivalent to restricted rst order logic by adding the binary temporal operators since and until we get the expressive power of rst order logic on trees Hence restricted pro...

متن کامل

Concurrency with partial information

The aim of this paper is to introduce a new formalism for multi-agent systems that captures (true) concurrency and independence. We begin describing a complete and decidable propositional multi-modal logic. The language, similar to Propositional Dynamic Logic in many aspects, di ers from usual modal logic: modal operators are non-atomic (they are built out of basic actions) and capture concurre...

متن کامل

Bisimulations, Model Descriptions and Propositional Quantiiers

In this paper we give perspicuous proofs of the existence of model descriptions for nite Kripke models and of Uniform Interpolation for the theories IPC, K, GL and S4Grz, using bounded bisim-ulations.

متن کامل

Constant Domain Quanti ed Modal Logics Without Boolean Negation

There is a natural way to add rules for rst-order quanti ers to proof theories for propositional relevant logics, and there is a natural way to add evaluation conditions for quanti ers to the semantics for propositional relevant logics. Kit Fine has shown us that these two natural ways of modelling rst order relevant logics do not match up [6]. Furthermore, Fine has given a semantics for the na...

متن کامل

Comprehension of Simple Quanti ers Empirical Evaluation of a Computational Model

We compare time needed for understanding di erent types of quanti ers. In the rst study, we show that the distinction between quanti ers recognized by nite-automata and push-down automata is psychologically relevant. In the second study, we compare comprehension of push-down quanti ers in universes with randomly placed objects and those where objects were ordered in some speci c way simplifying...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996